//
// Created by xili on 2024/8/13 19:24.
// GO BIG OR GO HOME.
//
#include "leetcode.h"

class Solution {
public:
    string firstPalindrome(vector <string> &words) {
        for (auto &item: words) {
            string temp = item;
            reverse(temp.begin(), temp.end());
            if (temp == item) {
                return item;
            }
        }
        return "";
    }
};